On the hull numbers of torus links
نویسندگان
چکیده
Introduced in [1] by Jason Cantarella, Greg Kuperberg, Robert B. Kusner, and John M. Sullivan, the hull number is a complexity measure for links similar to the bridge number. By definition, it is the maximum integer n such that for any realization of the link there is a point c ∈ R such that any plane through c intersects the curves representing the link at least 2n times. Clearly, the hull number is less than or equal to the bridge number. An elegant statement proved in [1] says that the hull number of a nontrivial knot is at least 2. By an integral-geometric argument this yields a new proof of Fáry-Milnor theorem. The authors posed the question of finding links and knots with large hull numbers. Unexpectedly enough, it is difficult already to find a knot with hull number at least 3. It was conjectured that the (3, 4)-torus knot has hull number 3. However, we show this to be false (see Figure 1). In the present paper we study hull numbers of torus links and prove two lower bounds. First, for non-trivial torus links with p components (and more generally, for any link with p pairwise non-trivially linked components) we show that the hull number is at least 3 5 p. This bound is sharp in the sense that for any p there are p-component links with components non-trivially linked and with hull number ⌈ 5 p⌉. In particular, these are (p, p)-torus links (“multi-Hopf links”). Secondly, for the hull number of a (p, q)-torus link with p ≤ q we prove the lower bound 1 2 p. In both cases, the scheme of the proof is to show that a plane intersecting the link in a small number of points cuts off an accordingly small portion of the link, and to apply Helly’s theorem. The idea to use Helly’s theorem for the study of hull numbers appeared already in [1].
منابع مشابه
A Statistical Study of two Diffusion Processes on Torus and Their Applications
Diffusion Processes such as Brownian motions and Ornstein-Uhlenbeck processes are the classes of stochastic processes that have been investigated by researchers in various disciplines including biological sciences. It is usually assumed that the outcomes of these processes are laid on the Euclidean spaces. However, some data in physical, chemical and biological phenomena indicate that they cann...
متن کاملNumerical Investigation on the Effect of Tunnel Height on Drag Reduction in a High Speed Trimaran
There are different methods to reduce drag in high speed hulls. One of these methods is a change in the shape of the body by adding longitudinal side tunnels. In this paper it has been attempted to determine the influence of the tunnel height on hydrodynamic characteristics of the hull to achieving an optimum shape for the tunnel. To achieve this purpose, numerical simulation of the problem has...
متن کاملNumerical simulation of hull and propeller interaction in acceleration maneuver
Prediction of a ship’s trajectory during a maneuvering motion is so important. In this study, the acceleration maneuver for a twin-screw vessel is directly investigated using computational fluid dynamic (CFD) environment and unsteady RANS (Reynolds Averaged Navier-Stokes) solver. For this purpose, the self-propulsion and acceleration simulations with hull and propeller interaction for the well-...
متن کاملInvestigation of the prevalence of Torus Mandibularis and Torus palatinus in Attendants of rafsanjan Dental school
the prevalence of Torus palatinus and Torus Mandibularis is widely different in various populations and races.this descriptive study was performed in 1999,to investigate the the prevalence of Torus Mandibularis and Torus palatinus in patients referring to Rafsanjan dental school.584 patients(268 men and 316 women) which were over 18 years old were examined.the information recorded in the questi...
متن کاملThe Additivity of Crossing Numbers
It has long been conjectured that the crossing numbers of links are additive under the connected sum of links. This is a difficult problem in knot theory and has been open for more than 100 years. In fact, we do not even know that Cr(K1#K2) = Cr(K1) or Cr(K1#K2) = Cr(K2) holds in general, here K1#K2 is the connected sum of K1 and K2 and Cr(K) stands for the crossing number of the link K. The be...
متن کامل